Factorization of network reliability with perfect nodes II: Connectivity matrix
نویسندگان
چکیده
منابع مشابه
Neural Network Matrix Factorization
Data often comes in the form of an array or matrix. Matrix factorization techniques attempt to recover missing or corrupted entries by assuming that the matrix can be written as the product of two low-rank matrices. In other words, matrix factorization approximates the entries of the matrix by a simple, fixed function—namely, the inner product—acting on the latent feature vectors for the corres...
متن کاملEstimation of Network Reliability for a Fully Connected Network with Unreliable Nodes and Unreliable Edges using Neuro Optimization
In this paper it is tried to estimate the reliability of a fully connected network of some unreliable nodes and unreliable connections (edges) between them. The proliferation of electronic messaging has been witnessed during the last few years. The acute problem of node failure and connection failure is frequently encountered in communication through various types of networks. We know that a ne...
متن کاملdeterminant of the hankel matrix with binomial entries
abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.
15 صفحه اولNetwork Reliability Monte Carlo With Nodes Subject to Failure
We extend the network reliability estimation methodology based on evolution (creation) Monte Carlo into four directions: (i) introducing unreliable nodes; (ii) adjusting the evolution process with merging to "closure" operation suitable for unreliable nodes; (iii) in case of numerical instability in computing convolutions, we suggest a special Monte Carlo algorithm based on importance sampling;...
متن کاملPreconditioning with Matrix Factorization
Pietsch Factorization and Grothendieck Factorization are the two landmark theorems in modern functional analysis. They were first introduced to the numerical linear algebra community by the work of Joel A. Tropp in the column subset selection problem, which seeks to extract from a matrix a column submatrix that has lower spectral norm. Despite their broad application in functional analysis, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2016
ISSN: 0166-218X
DOI: 10.1016/j.dam.2015.06.005